Sphere Online Judge
sign in
News
Problems
basics
challenge
classical
none
partial
riddle
tutorial
Status
Ranking
Forum
SPOJ
time:
2024-11-19
17 : 23 : 16
All
ADA95
DOC
ASM32-GCC
ASM32
ASM64
GAWK
MAWK
BASH
BC
BF
C-CLANG
C
NCSHARP
CSHARP
C++ 4.3.2
CPP
CPP14-CLANG
CPP14
C99
CLPS
CLOJURE
COBOL
COFFEE
LISP clisp
LISP sbcl
D
D-CLANG
D-DMD
DART
ELIXIR
ERL
FSHARP
FANTOM
FORTH
FORTRAN
GO
GOSU
GRV
HASK
ICON
ICK
JAR
JAVA
JS-RHINO
JS-MONKEY
JULIA
KTLN
LUA
NEM
NICE
NIM
NODEJS
OBJC
OBJC-CLANG
OCAML
OCT
PAS-GPC
PAS-FPC
PDF
PERL
PERL6
PHP
PICO
PIKE
PS
PRLG-swi
PROLOG
PYTHON
PYPY
PYPY3
PYTHON3
PY_NBC
R
RACKET
RUBY
RUST
SCALA
SCM guile
CHICKEN
SCM qobi
SED
ST
SQLITE
SWIFT
TCL
TEXT
UNLAMBDA
VB.NET
WHITESPACE
list of tutorial problems
<
Previous
11
12
13
14
15
16
17
18
19
20
21
Next
>
ID
NAME
CODE
USERS
ACC %
24250
Numero Palindromo
NPALIN
22
61.97
24314
Dado Opuesto
DADOOP
76
28.17
24315
Los N primeros números impares
NIMPARES
70
71.93
24316
Un segundo después
MAS1SEG
27
38.03
24317
Mayor de Tres
MAYDE3
53
74.36
24318
Número Alternantes
ALTERNAN
22
37.31
24737
Fibo and non fibo(Hard)
POWFIB2
9
14.21
30753
Ada and Economy
ADAMONEY
116
27.81
30784
Ada and Pear
ADAPEAR
9
10.64
30829
ARE YOU GOOD IN MATHS?
BABA1
267
32.08
30831
Easy Stack
STACKEZ
1618
23.65
30832
Easy Queue
QUEUEEZ
1524
26.87
30840
Ada and Database
ADABASET
17
39.39
30847
Traversing Tree
TREEVERSE
117
21.27
30891
Sản xuất
SANXUAT
0
0.00
30907
Easy Fibonacci
FIBEZ
568
14.37
31066
Number Breaking
BREAKING
761
30.65
31138
Just Sum
SIMSUM
8
13.19
31182
Sub array Sum1
IITKESOA3P1
91
34.34
31183
Sub array Sum2
IITKESOA3P2
41
16.12
31283
Count The Players
AGPC01C
49
25.87
31288
Too Late
AGPC01B
55
8.62
31934
Last Digit of Power
LSTDGT
77
20.40
31939
FFT and inverse FFT
IITKESO207SPA1
136
23.76
32013
Red-Black Trees
IITKESO207SPA2
177
85.85
32045
Coin Game
IITKESO207SPA3A
168
91.39
32046
Knapsack Problem
IITKESO207SPA3B
148
90.96
32047
Optimal BST
IITKESO207SPA3C
132
92.27
32048
Largest bunch of zeros
IITKESO207SPA3D
157
93.35
32073
The Permutation Game
TPGAME
31
69.44
32105
Maybe a Minimum Spanning Tree
IITKESO207SPA3E
122
91.04
32106
Simple Dijkstras algorithm
IITKESO207SPA3F1
130
92.41
32107
Simple Dijkstras algorithm again
IITKESO207SPA3F2
124
95.72
32108
Lexicographic Permutations
IITKESO207SPA4A
133
93.01
32109
Relaying the roads
IITKESO207SPA4B
133
95.99
32260
Implement FFT and its inverse
IITKESO207A_1P_1
224
23.15
32445
COUNT JUMPS
KLUG1
90
41.33
32447
How many are placed at last positions
LASTPOS
34
86.06
32470
Make Versions in Segment Tree
PSEGTREE
393
45.05
32684
Calculator
IITKESO207A_2P_1
0
0.00
32685
Calculator
IITKESO207A_2P
226
94.00
33305
Single Source Shortest Path
IITKESO207A_4P_1
197
20.08
33329
Finding Max
MAXEZ
14
82.76
33792
String
CAPL
20
7.34
33796
Print String
PRINTIT3
45
25.68
33836
Floor Arithmetics
FLARIT
8
44.12
34008
Base and Power
BAPM
113
28.73
34010
Friendship
FRNDAM
181
52.73
34137
Memory Game 1
IITKESO207PA3Q1
85
39.92
34138
Memory Game 2
IITKESO207PA3Q2
77
31.13
© Spoj.com. All Rights Reserved. Spoj uses
Sphere Engine
™ © by
Sphere Research Labs
.